Distributed Linear Hashing and Parallel Projection in Main Memory Databases
نویسندگان
چکیده
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher level parallel dambase operations. The basic distributed linear hashing technique provides a high speed hash based dynamic file system on a NUMA atchitecture multi-processor system. Distributed linear hashing has been extended to include the ability to perform high speed parallel scans of the hashed file. The fast scan feature provides load balancing to compensate for uneven distributions of records and uneven processing speed among different processors. These extensions are used to implement a parallel projection capability. The performance of distributed linear hashing and parallel projection is investigated.
منابع مشابه
Extendible Chained Bucket Hashing for Main Memory Databases
The objective of this paper is to develop a high performance hash-based access method for main memory database systems. Chained bucket hashing is known to provide the fastest random access to a static file stored in main memory. For a dynamic file, however, chained bucket hashing is inappropriate because its address space cannot be adapted to the file size without total reorganization. Extendib...
متن کاملPerformance Analysis of a Main Memory Multi-Directory Hashing Technique
Optimal search in main memory databases requires at most one key comparison to locate a record. Extendible hashing becomes impractical when it is adapted to yield optimal search in main memory databases because of its large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over extendible hashing. The objective of this paper is to analyz...
متن کاملParallel tree-projection-based sequence mining algorithms
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient, scalable, and parallel algorithms. Even though a number of algorithms have been developed to efficiently parallelize frequent pattern discovery algorithms that are based on the...
متن کاملParallel Formulations of Tree-Projection Based Sequence Mining Algorithms
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient, scalable, and parallel algorithms. Even though a number of algorithms have been developed to efficiently parallelize frequent pattern discovery algorithms that are based on the...
متن کاملParallel Formulations of Tree-Projection-Based Sequence Mining Algorithm
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient, scalable, and parallel algorithms. Even though a number of algorithms have been developed to efficiently parallelize frequent pattern discovery algorithms that are based on the...
متن کامل